class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
if len(matrix) == 0:
return False
if len(matrix[0]) == 0:
return False
start = 0
end = len(matrix) -1
value = -1
while start<= end:
mid = (start+end)//2
if matrix[mid][0] <= target:
value = mid
start = mid +1
else:
end = mid-1
print(value)
if value==-1:
return False
start = 0
end = len(matrix[value]) -1
while start<= end:
mid = (start+end)//2
if matrix[value][mid] == target:
return True
elif matrix[value][mid] < target:
start = mid+1
else:
end = mid-1
return False
383. Ransom Note | 242. Valid Anagram |
141. Linked List Cycle | 21. Merge Two Sorted Lists |
203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |
169. Majority Element | 119. Pascal's Triangle II |
409. Longest Palindrome | 1574A - Regular Bracket Sequences |
1574B - Combinatorics Homework | 1567A - Domino Disaster |
1593A - Elections | 1607A - Linear Keyboard |
EQUALCOIN Equal Coins | XOREQN Xor Equation |
MAKEPAL Weird Palindrome Making | HILLSEQ Hill Sequence |